Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator
نویسندگان
چکیده
We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically, and for computing the Cartier-Manin operator of hyperelliptic curves.
منابع مشابه
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
We improve an algorithm originally due to Chudnovsky and Chudnovsky for computing one selected term in a linear recurrent sequence with polynomial coefficients. Using baby-steps / giant-steps techniques, the nth term in such a sequence can be computed in time proportional to √ n, instead of n for a naive approach. As an intermediate result, we give a fast algorithm for computing the values take...
متن کاملDefinite Sums as Solutions of Linear Recurrences With Polynomial Coefficients
We present an algorithm which, given a linear recurrence operator L with polynomial coefficients, m ∈ N \ {0}, a1, a2, . . . , am ∈ N \ {0} and b1, b2, . . . , bm ∈ K, returns a linear recurrence operator L ′ with rational coefficients such that for every sequence h,
متن کاملIntroduction: Information Technology in Human Activity
In this paper the reducibility and factoring for the homogeneous linear ODE operator of higher order is studied mainly for the 2nd order case. The determination of reducibility and the construction of factors are not difficult for the 2nd order ODE if the coefficients of the factorization are restricted to polynomials. The decision and the construction are also possible when the coefficients of...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2007